Acceptable Strategy Profiles in Stochastic Games
نویسنده
چکیده
This paper presents a new solution concept for multiplayer stochastic games, namely, acceptable strategy profiles. For each player i and state s in a stochastic game, let wi(s) be a real number. A strategy profile is w-acceptable, where w = (wi(s)), if the discounted payoff to each player i at every initial state s is at least wi(s), provided the discount factor of the players is sufficiently close to 1. Our goal is to provide simple strategy profiles that are w-acceptable for payoff vectors w in which all coordinates are high.
منابع مشابه
Deterministic equations for stochastic spatial evolutionary games
Spatial evolutionary games model individuals playing a game with their neighbors in a spatial domain and describe the time evolution of strategy profile of individuals over space. We derive integro-differential equations as deterministic approximations of strategy revision stochastic processes. These equations generalize the existing ordinary differential equations such as replicator dynamics a...
متن کاملStrategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with ω-regular winning conditions specified as parity objectives. These games lie in NP ∩ coNP. We present a strategy improvement algorithm for stochastic parity games; this is the first non-brute-force algorithm for solving these games. From the strategy improveme...
متن کاملComputing Strong Nash Equilibria for Multiplayer Games
A new method for computing strong Nash equilibria in multiplayer games that uses the theoretical framework of generative relations combined with a stochastic search method is presented. Generative relations provide a mean to compare two strategy profiles and to assess their relative quality with respect to an equilibria type. The stochastic method used, called Aumann Crowding Based Differential...
متن کاملGlobal Nash convergence of Foster and Young's regret testing
We construct an uncoupled randomized strategy of repeated play such that, if every player plays according to it, mixed action profiles converge almost surely to a Nash equilibrium of the stage game. The strategy requires very little in terms of information about the game, as players’ actions are based only on their own past payoffs. Moreover, in a variant of the procedure, players need not know...
متن کاملRobust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks
Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1608.05272 شماره
صفحات -
تاریخ انتشار 2016